Constructions of optimal LCD codes over large finite fields
نویسندگان
چکیده
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.
منابع مشابه
Some new bounds on LCD codes over finite fields
In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n, 2) over F3 and F4. We study the bound of LCD codes over Fq.
متن کاملGalois LCD codes over finite fields
In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...
متن کاملNew constructions of MDS codes with complementary duals
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. MDS codes are optimal in the sense that the m...
متن کاملAuthentication codes based on resilient Boolean maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps wh...
متن کاملVector-Circulant Matrices and Vector-Circulant Based Additive Codes over Finite Fields
Circulant matrices have attracted interest due to their rich algebraic structures and various applications. In this paper, the concept of vector-circulant matrices over finite fields is studied as a generalization of circulant matrices. The algebraic characterization for such matrices has been discussed. As applications, constructions of vector-circulant based additive codes over finite fields ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 50 شماره
صفحات -
تاریخ انتشار 2018